Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
نویسندگان
چکیده
منابع مشابه
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many algorithms for FPT graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that using the global structure of input graphs complements the the search tree paradigm. Here we prove some new results based on the global structure of bounded-degree graphs after branching away the high-degree vertices. Some techniques and structural result...
متن کاملSolving Graph Isomorphism Using Parameterized Matching
We propose a new approach to solve graph isomorphism using parameterized matching. To find isomorphism between two graphs, one graph is linearized, i.e., represented as a graph walk that covers all nodes and edges such that each element is represented by a parameter. Next, we match the graph linearization on the second graph, searching for a bijective function that maps each element of the firs...
متن کاملFaster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
We give a O(k) time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by k which improves on the previous best running time bound of O(2 / log ) [EP97a].
متن کاملOn Bounded-Degree Vertex Deletion parameterized by treewidth
Given an undirected graph G and an integer d ≥ 0, the NP-hard BoundedDegree Vertex Deletion problem asks to delete as few vertices as possible from G such that the resulting graph has maximum vertex degree d. Our main result is to prove that Bounded-Degree Vertex Deletion is W[1]-hard with respect to the parameter treewidth. As a side result, we obtain that the NP-hard Vector Dominating Set pro...
متن کاملreciprocal degree distance of some graph operations
the reciprocal degree distance (rdd), defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances, that is, $rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u) + d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index, just as the degree distance is a weight version of the wiener index. in this paper, we present exact formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0045-3